Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Biogeometry Research Faster Multiple Sequence Alignment Algorithms Based on Pairwise Segmentation

Multiple Sequence Alignment (MSA) is a central problem in computational molecular biology --it identifies and quantifies similarities among several protein or DNA sequences.The well-known dynamic programming (DP) algorithms align k sequences (each of length n) by constructing a k-dimensional grid graph of size O(nk), with each of the sequences enumerating one of the dimensions of the grid. The ...

متن کامل

Improvements on bicriteria pairwise sequence alignment: algorithms and applications

MOTIVATION In this article, we consider the bicriteria pairwise sequence alignment problem and propose extensions of dynamic programming algorithms for several problem variants with a novel pruning technique that efficiently reduces the number of states to be processed. Moreover, we present a method for the construction of phylogenetic trees based on this bicriteria framework. Two exemplary cas...

متن کامل

On distance-based inconsistency reduction algorithms for pairwise comparisons

One of the major challenges for collective intelligence is inconsistency, which is unavoidable whenever subjective assessments are involved. Pairwise comparisons allow one to represent such subjective assessments and to process them by analyzing, quantifying and identifying the inconsistencies. We propose using smaller scales for pairwise comparisons and provide mathematical and practical justi...

متن کامل

Fast A Algorithms for Multiple Sequence Alignment

The multiple alignment of the sequences of DNA and proteins is applicable to various important elds in molecular biology. Although the approach based on Dynamic Programming is well-known for this problem, it requires enormous time and space to obtain the optimal alignment. On the other hand, this problem corresponds to the shortest path problem and the A algorithm, which can e ciently nd the sh...

متن کامل

Pairwise Sequence Alignment

Instructions for obtaining the Solution Sheet are available by sending email to [email protected], with no subject line, and the following message body: subscribe vsns-bcd-solutions VSNS{BCD Copyright. The text may be redistributed verbatim, in whole or in part, for research and educational purposes only. If distributed in part, it must include this copyright notice, and a pointer ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE/ACM Transactions on Computational Biology and Bioinformatics

سال: 2006

ISSN: 1545-5963

DOI: 10.1109/tcbb.2006.53